Bipartite graphs can have any number of independent sets
نویسندگان
چکیده
منابع مشابه
on the number of maximum independent sets of graphs
let $g$ be a simple graph. an independent set is a set ofpairwise non-adjacent vertices. the number of vertices in a maximum independent set of $g$ isdenoted by $alpha(g)$. in this paper, we characterize graphs $g$ with $n$ vertices and with maximumnumber of maximum independent sets provided that $alpha(g)leq 2$ or $alpha(g)geq n-3$.
متن کاملINDEPENDENT SETS OF SOME GRAPHS ASSOCIATED TO COMMUTATIVE RINGS
Let $G=(V,E)$ be a simple graph. A set $Ssubseteq V$ isindependent set of $G$, if no two vertices of $S$ are adjacent.The independence number $alpha(G)$ is the size of a maximumindependent set in the graph. In this paper we study and characterize the independent sets ofthe zero-divisor graph $Gamma(R)$ and ideal-based zero-divisor graph $Gamma_I(R)$of a commutative ring $R$.
متن کاملA graph polynomial for independent sets of bipartite graphs
We introduce a new graph polynomial that encodes interesting properties of graphs, for example, the number of matchings, the number of perfect matchings, and, for bipartite graphs, the number of independent sets (#BIS). We analyse the complexity of exact evaluation of the polynomial at rational points and show a dichotomy result: for most points exact evaluation is #P-hard (assuming the general...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملBohdan Zelinka INDEPENDENT SET DOMINATING SETS IN BIPARTITE GRAPHS
The paper continues the study of independent set dominating sets in graphs which was started by E. Sampathkumar. A subset D of the vertex set V (G) of a graph G is called a set dominating set (shortly sd−set) in G, if for each set X ⊆ V (G) −D there exists a set Y ⊆ D such that the subgraph 〈X ∪ Y 〉 of G induced by X ∪ Y is connected. The minimum number of vertices of an sd−set in G is called t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1989
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90306-3